Termination proof of /tmp/tmp5XVPYm/NestedLoop.jar

Termination of the given JBC could be proven:

0 JBC

↳1 JBCToGraph (⇒, 900 ms)

↳2 JBCTerminationGraph

↳3 TerminationGraphToSCCProof (⇒, 0 ms)

↳4 AND

    ↳5 JBCTerminationSCC

        ↳6 SCCToIDPv1Proof (⇒, 90 ms)

        ↳7 IDP

        ↳8 IDPNonInfProof (⇒, 260 ms)

        ↳9 AND

            ↳10 IDP

                ↳11 IDependencyGraphProof (⇔, 0 ms)

                ↳12 TRUE

            ↳13 IDP

                ↳14 IDependencyGraphProof (⇔, 0 ms)

                ↳15 TRUE

    ↳16 JBCTerminationSCC

        ↳17 SCCToIDPv1Proof (⇒, 390 ms)

        ↳18 IDP

        ↳19 IDPNonInfProof (⇒, 2480 ms)

        ↳20 IDP

        ↳21 IDependencyGraphProof (⇔, 0 ms)

        ↳22 IDP

        ↳23 IDPNonInfProof (⇒, 400 ms)

        ↳24 IDP

        ↳25 IDependencyGraphProof (⇔, 0 ms)

        ↳26 TRUE

    ↳27 JBCTerminationSCC

        ↳28 SCCToIDPv1Proof (⇒, 200 ms)

        ↳29 IDP

        ↳30 IDPNonInfProof (⇒, 130 ms)

        ↳31 AND

            ↳32 IDP

                ↳33 IDependencyGraphProof (⇔, 0 ms)

                ↳34 TRUE

            ↳35 IDP

                ↳36 IDependencyGraphProof (⇔, 0 ms)

                ↳37 TRUE

(0) Obligation:

JBC Problem based on JBC Program:
Manifest-Version: 1.0 Created-By: 1.6.0_20 (Sun Microsystems Inc.) Main-Class: NestedLoop

public class NestedLoop {
	public static void main(String[] args) {
		int i, j, z, n;
		n = args.length;
		int[] a = new int[n];
		for(i = 0;i< n-1;i++){
			a[i] = args[i].length();
		}

		for (i = 0; i < n - 1; i++) {
			for (j = i + 1; j < n; j++) {
				if(a[i]< a[j]){
					z = a[i]; a[i] = a[j]; a[j] = z;
				}
			}
		}
		for(i = 0;i< n -1;i++){
		}
	}
}

(1) JBCToGraph (SOUND transformation)

Constructed TerminationGraph.

(2) Obligation:

Termination Graph based on JBC Program:
NestedLoop.main([Ljava/lang/String;)V: Graph of 349 nodes with 3 SCCs.

(3) TerminationGraphToSCCProof (SOUND transformation)

Splitted TerminationGraph to 3 SCCss.

(4) Complex Obligation (AND)

(5) Obligation:

SCC of termination graph based on JBC Program.
SCC contains nodes from the following methods: NestedLoop.main([Ljava/lang/String;)V
SCC calls the following helper methods:
Performed SCC analyses: UsedFieldsAnalysis

(6) SCCToIDPv1Proof (SOUND transformation)

Transformed FIGraph SCCs to IDPs. Log:

Generated 9 rules for P and 0 rules for R.

P rules:
2035_0_main_Load(EOS(STATIC_2035), i644, i224, i644) → 2048_0_main_ConstantStackPush(EOS(STATIC_2048), i644, i224, i644, i224)
2048_0_main_ConstantStackPush(EOS(STATIC_2048), i644, i224, i644, i224) → 2072_0_main_IntArithmetic(EOS(STATIC_2072), i644, i224, i644, i224, 1)
2072_0_main_IntArithmetic(EOS(STATIC_2072), i644, i224, i644, i224, matching1) → 2092_0_main_GE(EOS(STATIC_2092), i644, i224, i644, -(i224, 1)) | &&(>=(i224, 0), =(matching1, 1))
2092_0_main_GE(EOS(STATIC_2092), i644, i224, i644, i682) → 2115_0_main_GE(EOS(STATIC_2115), i644, i224, i644, i682)
2115_0_main_GE(EOS(STATIC_2115), i644, i224, i644, i682) → 2182_0_main_Inc(EOS(STATIC_2182), i644, i224) | <(i644, i682)
2182_0_main_Inc(EOS(STATIC_2182), i644, i224) → 2202_0_main_JMP(EOS(STATIC_2202), +(i644, 1), i224) | >=(i644, 0)
2202_0_main_JMP(EOS(STATIC_2202), i726, i224) → 2219_0_main_Load(EOS(STATIC_2219), i726, i224)
2219_0_main_Load(EOS(STATIC_2219), i726, i224) → 2014_0_main_Load(EOS(STATIC_2014), i726, i224)
2014_0_main_Load(EOS(STATIC_2014), i644, i224) → 2035_0_main_Load(EOS(STATIC_2035), i644, i224, i644)
R rules:

Combined rules. Obtained 1 conditional rules for P and 0 conditional rules for R.

P rules:
2035_0_main_Load(EOS(STATIC_2035), x0, x1, x0) → 2035_0_main_Load(EOS(STATIC_2035), +(x0, 1), x1, +(x0, 1)) | &&(&&(>(+(x1, 1), 0), >(+(x0, 1), 0)), <(x0, -(x1, 1)))
R rules:

Filtered ground terms:

2035_0_main_Load(x1, x2, x3, x4) → 2035_0_main_Load(x2, x3, x4)
EOS(x1) → EOS
Cond_2035_0_main_Load(x1, x2, x3, x4, x5) → Cond_2035_0_main_Load(x1, x3, x4, x5)

Filtered duplicate args:

2035_0_main_Load(x1, x2, x3) → 2035_0_main_Load(x2, x3)
Cond_2035_0_main_Load(x1, x2, x3, x4) → Cond_2035_0_main_Load(x1, x3, x4)

Combined rules. Obtained 1 conditional rules for P and 0 conditional rules for R.

P rules:
2035_0_main_Load(x1, x0) → 2035_0_main_Load(x1, +(x0, 1)) | &&(&&(>(x1, -1), >(x0, -1)), <(x0, -(x1, 1)))
R rules:

Finished conversion. Obtained 2 rules for P and 0 rules for R. System has predefined symbols.

P rules:
2035_0_MAIN_LOAD(x1, x0) → COND_2035_0_MAIN_LOAD(&&(&&(>(x1, -1), >(x0, -1)), <(x0, -(x1, 1))), x1, x0)
COND_2035_0_MAIN_LOAD(TRUE, x1, x0) → 2035_0_MAIN_LOAD(x1, +(x0, 1))
R rules:

(7) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Boolean, Integer

R is empty.

The integer pair graph contains the following rules and edges:
(0): 2035_0_MAIN_LOAD(x1[0], x0[0]) → COND_2035_0_MAIN_LOAD(x1[0] > -1 && x0[0] > -1 && x0[0] < x1[0] - 1, x1[0], x0[0])
(1): COND_2035_0_MAIN_LOAD(TRUE, x1[1], x0[1]) → 2035_0_MAIN_LOAD(x1[1], x0[1] + 1)

(0) -> (1), if (x1[0] > -1 && x0[0] > -1 && x0[0] < x1[0] - 1 ∧x1[0] →^* x1[1]∧x0[0] →^* x0[1])

(1) -> (0), if (x1[1] →^* x1[0]∧x0[1] + 1 →^* x0[0])

The set Q is empty.

(8) IDPNonInfProof (SOUND transformation)

Used the following options for this NonInfProof:
IDPGPoloSolver: Range: [(-1,2)] IsNat: false Interpretation Shape Heuristic: aprove.DPFramework.IDPProblem.Processors.nonInf.poly.IdpCand1ShapeHeuristic@3f4a4567 Constraint Generator: NonInfConstraintGenerator: PathGenerator: MetricPathGenerator: Max Left Steps: 0 Max Right Steps: 0

The constraints were generated the following way:
The DP Problem is simplified using the Induction Calculus [NONINF] with the following steps:
Note that final constraints are written in bold face.

For Pair 2035_0_MAIN_LOAD(x1, x0) → COND_2035_0_MAIN_LOAD(&&(&&(>(x1, -1), >(x0, -1)), <(x0, -(x1, 1))), x1, x0) the following chains were created:

We consider the chain 2035_0_MAIN_LOAD(x1[0], x0[0]) → COND_2035_0_MAIN_LOAD(&&(&&(>(x1[0], -1), >(x0[0], -1)), <(x0[0], -(x1[0], 1))), x1[0], x0[0]), COND_2035_0_MAIN_LOAD(TRUE, x1[1], x0[1]) → 2035_0_MAIN_LOAD(x1[1], +(x0[1], 1)) which results in the following constraint:
(1)    (&&(&&(>(x1[0], -1), >(x0[0], -1)), <(x0[0], -(x1[0], 1)))=TRUE∧x1[0]=x1[1]∧x0[0]=x0[1] ⇒ 2035_0_MAIN_LOAD(x1[0], x0[0])≥NonInfC∧2035_0_MAIN_LOAD(x1[0], x0[0])≥COND_2035_0_MAIN_LOAD(&&(&&(>(x1[0], -1), >(x0[0], -1)), <(x0[0], -(x1[0], 1))), x1[0], x0[0])∧(U^Increasing(COND_2035_0_MAIN_LOAD(&&(&&(>(x1[0], -1), >(x0[0], -1)), <(x0[0], -(x1[0], 1))), x1[0], x0[0])), ≥))

We simplified constraint (1) using rules (IV), (IDP_BOOLEAN) which results in the following new constraint:
(2)    (<(x0[0], -(x1[0], 1))=TRUE∧>(x1[0], -1)=TRUE∧>(x0[0], -1)=TRUE ⇒ 2035_0_MAIN_LOAD(x1[0], x0[0])≥NonInfC∧2035_0_MAIN_LOAD(x1[0], x0[0])≥COND_2035_0_MAIN_LOAD(&&(&&(>(x1[0], -1), >(x0[0], -1)), <(x0[0], -(x1[0], 1))), x1[0], x0[0])∧(U^Increasing(COND_2035_0_MAIN_LOAD(&&(&&(>(x1[0], -1), >(x0[0], -1)), <(x0[0], -(x1[0], 1))), x1[0], x0[0])), ≥))

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(3)    (x1[0] + [-2] + [-1]x0[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_2035_0_MAIN_LOAD(&&(&&(>(x1[0], -1), >(x0[0], -1)), <(x0[0], -(x1[0], 1))), x1[0], x0[0])), ≥)∧[(-1)bni_10 + (-1)Bound*bni_10] + [(-1)bni_10]x0[0] + [bni_10]x1[0] ≥ 0∧[(-1)bso_11] ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(4)    (x1[0] + [-2] + [-1]x0[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_2035_0_MAIN_LOAD(&&(&&(>(x1[0], -1), >(x0[0], -1)), <(x0[0], -(x1[0], 1))), x1[0], x0[0])), ≥)∧[(-1)bni_10 + (-1)Bound*bni_10] + [(-1)bni_10]x0[0] + [bni_10]x1[0] ≥ 0∧[(-1)bso_11] ≥ 0)

We simplified constraint (4) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(5)    (x1[0] + [-2] + [-1]x0[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_2035_0_MAIN_LOAD(&&(&&(>(x1[0], -1), >(x0[0], -1)), <(x0[0], -(x1[0], 1))), x1[0], x0[0])), ≥)∧[(-1)bni_10 + (-1)Bound*bni_10] + [(-1)bni_10]x0[0] + [bni_10]x1[0] ≥ 0∧[(-1)bso_11] ≥ 0)

We simplified constraint (5) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(6)    (x1[0] ≥ 0∧[2] + x0[0] + x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_2035_0_MAIN_LOAD(&&(&&(>(x1[0], -1), >(x0[0], -1)), <(x0[0], -(x1[0], 1))), x1[0], x0[0])), ≥)∧[bni_10 + (-1)Bound*bni_10] + [bni_10]x1[0] ≥ 0∧[(-1)bso_11] ≥ 0)

For Pair COND_2035_0_MAIN_LOAD(TRUE, x1, x0) → 2035_0_MAIN_LOAD(x1, +(x0, 1)) the following chains were created:

We consider the chain COND_2035_0_MAIN_LOAD(TRUE, x1[1], x0[1]) → 2035_0_MAIN_LOAD(x1[1], +(x0[1], 1)) which results in the following constraint:
(7)    (COND_2035_0_MAIN_LOAD(TRUE, x1[1], x0[1])≥NonInfC∧COND_2035_0_MAIN_LOAD(TRUE, x1[1], x0[1])≥2035_0_MAIN_LOAD(x1[1], +(x0[1], 1))∧(U^Increasing(2035_0_MAIN_LOAD(x1[1], +(x0[1], 1))), ≥))

We simplified constraint (7) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(8)    ((U^Increasing(2035_0_MAIN_LOAD(x1[1], +(x0[1], 1))), ≥)∧[bni_12] = 0∧[1 + (-1)bso_13] ≥ 0)

We simplified constraint (8) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(9)    ((U^Increasing(2035_0_MAIN_LOAD(x1[1], +(x0[1], 1))), ≥)∧[bni_12] = 0∧[1 + (-1)bso_13] ≥ 0)

We simplified constraint (9) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(10)    ((U^Increasing(2035_0_MAIN_LOAD(x1[1], +(x0[1], 1))), ≥)∧[bni_12] = 0∧[1 + (-1)bso_13] ≥ 0)

We simplified constraint (10) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(11)    ((U^Increasing(2035_0_MAIN_LOAD(x1[1], +(x0[1], 1))), ≥)∧[bni_12] = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_13] ≥ 0)

To summarize, we get the following constraints P_≥ for the following pairs.

2035_0_MAIN_LOAD(x1, x0) → COND_2035_0_MAIN_LOAD(&&(&&(>(x1, -1), >(x0, -1)), <(x0, -(x1, 1))), x1, x0)
- (x1[0] ≥ 0∧[2] + x0[0] + x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_2035_0_MAIN_LOAD(&&(&&(>(x1[0], -1), >(x0[0], -1)), <(x0[0], -(x1[0], 1))), x1[0], x0[0])), ≥)∧[bni_10 + (-1)Bound*bni_10] + [bni_10]x1[0] ≥ 0∧[(-1)bso_11] ≥ 0)
COND_2035_0_MAIN_LOAD(TRUE, x1, x0) → 2035_0_MAIN_LOAD(x1, +(x0, 1))
- ((U^Increasing(2035_0_MAIN_LOAD(x1[1], +(x0[1], 1))), ≥)∧[bni_12] = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_13] ≥ 0)

The constraints for P_> respective P_bound are constructed from P_≥ where we just replace every occurence of "t ≥ s" in P_≥ by "t > s" respective "t ≥ c". Here c stands for the fresh constant used for P_bound.
Using the following integer polynomial ordering the resulting constraints can be solved
Polynomial interpretation over integers[POLO]:

POL(TRUE) = 0
POL(FALSE) = 0
POL(2035_0_MAIN_LOAD(x₁, x₂)) = [-1] + [-1]x₂ + x₁
POL(COND_2035_0_MAIN_LOAD(x₁, x₂, x₃)) = [-1] + [-1]x₃ + x₂
POL(&&(x₁, x₂)) = [-1]
POL(>(x₁, x₂)) = [-1]
POL(-1) = [-1]
POL(<(x₁, x₂)) = [-1]
POL(-(x₁, x₂)) = x₁ + [-1]x₂
POL(1) = [1]
POL(+(x₁, x₂)) = x₁ + x₂

The following pairs are in P_>:

COND_2035_0_MAIN_LOAD(TRUE, x1[1], x0[1]) → 2035_0_MAIN_LOAD(x1[1], +(x0[1], 1))

The following pairs are in P_bound:

2035_0_MAIN_LOAD(x1[0], x0[0]) → COND_2035_0_MAIN_LOAD(&&(&&(>(x1[0], -1), >(x0[0], -1)), <(x0[0], -(x1[0], 1))), x1[0], x0[0])

The following pairs are in P_≥:

2035_0_MAIN_LOAD(x1[0], x0[0]) → COND_2035_0_MAIN_LOAD(&&(&&(>(x1[0], -1), >(x0[0], -1)), <(x0[0], -(x1[0], 1))), x1[0], x0[0])

There are no usable rules.

(9) Complex Obligation (AND)

(10) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Boolean, Integer

(11) IDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.

(12) TRUE

(13) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Integer

R is empty.

The integer pair graph contains the following rules and edges:
(1): COND_2035_0_MAIN_LOAD(TRUE, x1[1], x0[1]) → 2035_0_MAIN_LOAD(x1[1], x0[1] + 1)

The set Q is empty.

(14) IDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.

(15) TRUE

(16) Obligation:

(17) SCCToIDPv1Proof (SOUND transformation)

Transformed FIGraph SCCs to IDPs. Log:

Generated 53 rules for P and 0 rules for R.

P rules:
1429_0_main_Load(EOS(STATIC_1429), i310, i224, java.lang.Object(ARRAY(i224)), i310) → 1431_0_main_ConstantStackPush(EOS(STATIC_1431), i310, i224, java.lang.Object(ARRAY(i224)), i310, i224)
1431_0_main_ConstantStackPush(EOS(STATIC_1431), i310, i224, java.lang.Object(ARRAY(i224)), i310, i224) → 1433_0_main_IntArithmetic(EOS(STATIC_1433), i310, i224, java.lang.Object(ARRAY(i224)), i310, i224, 1)
1433_0_main_IntArithmetic(EOS(STATIC_1433), i310, i224, java.lang.Object(ARRAY(i224)), i310, i224, matching1) → 1435_0_main_GE(EOS(STATIC_1435), i310, i224, java.lang.Object(ARRAY(i224)), i310, -(i224, 1)) | &&(>=(i224, 0), =(matching1, 1))
1435_0_main_GE(EOS(STATIC_1435), i310, i224, java.lang.Object(ARRAY(i224)), i310, i315) → 1438_0_main_GE(EOS(STATIC_1438), i310, i224, java.lang.Object(ARRAY(i224)), i310, i315)
1438_0_main_GE(EOS(STATIC_1438), i310, i224, java.lang.Object(ARRAY(i224)), i310, i315) → 1441_0_main_Load(EOS(STATIC_1441), i310, i224, java.lang.Object(ARRAY(i224))) | <(i310, i315)
1441_0_main_Load(EOS(STATIC_1441), i310, i224, java.lang.Object(ARRAY(i224))) → 1445_0_main_ConstantStackPush(EOS(STATIC_1445), i310, i224, java.lang.Object(ARRAY(i224)), i310)
1445_0_main_ConstantStackPush(EOS(STATIC_1445), i310, i224, java.lang.Object(ARRAY(i224)), i310) → 1448_0_main_IntArithmetic(EOS(STATIC_1448), i310, i224, java.lang.Object(ARRAY(i224)), i310, 1)
1448_0_main_IntArithmetic(EOS(STATIC_1448), i310, i224, java.lang.Object(ARRAY(i224)), i310, matching1) → 1452_0_main_Store(EOS(STATIC_1452), i310, i224, java.lang.Object(ARRAY(i224)), +(i310, 1)) | &&(>=(i310, 0), =(matching1, 1))
1452_0_main_Store(EOS(STATIC_1452), i310, i224, java.lang.Object(ARRAY(i224)), i320) → 1455_0_main_Load(EOS(STATIC_1455), i310, i320, i224, java.lang.Object(ARRAY(i224)))
1455_0_main_Load(EOS(STATIC_1455), i310, i320, i224, java.lang.Object(ARRAY(i224))) → 1459_0_main_Load(EOS(STATIC_1459), i310, i320, i224, java.lang.Object(ARRAY(i224)), i320)
1459_0_main_Load(EOS(STATIC_1459), i310, i320, i224, java.lang.Object(ARRAY(i224)), i320) → 1463_0_main_GE(EOS(STATIC_1463), i310, i320, i224, java.lang.Object(ARRAY(i224)), i320, i224)
1463_0_main_GE(EOS(STATIC_1463), i310, i320, i224, java.lang.Object(ARRAY(i224)), i320, i224) → 1468_0_main_GE(EOS(STATIC_1468), i310, i320, i224, java.lang.Object(ARRAY(i224)), i320, i224)
1463_0_main_GE(EOS(STATIC_1463), i310, i320, i224, java.lang.Object(ARRAY(i224)), i320, i224) → 1469_0_main_GE(EOS(STATIC_1469), i310, i320, i224, java.lang.Object(ARRAY(i224)), i320, i224)
1468_0_main_GE(EOS(STATIC_1468), i310, i320, i224, java.lang.Object(ARRAY(i224)), i320, i224) → 1474_0_main_Inc(EOS(STATIC_1474), i310, i224, java.lang.Object(ARRAY(i224))) | >=(i320, i224)
1474_0_main_Inc(EOS(STATIC_1474), i310, i224, java.lang.Object(ARRAY(i224))) → 1481_0_main_JMP(EOS(STATIC_1481), +(i310, 1), i224, java.lang.Object(ARRAY(i224))) | >=(i310, 0)
1481_0_main_JMP(EOS(STATIC_1481), i327, i224, java.lang.Object(ARRAY(i224))) → 1492_0_main_Load(EOS(STATIC_1492), i327, i224, java.lang.Object(ARRAY(i224)))
1492_0_main_Load(EOS(STATIC_1492), i327, i224, java.lang.Object(ARRAY(i224))) → 1427_0_main_Load(EOS(STATIC_1427), i327, i224, java.lang.Object(ARRAY(i224)))
1427_0_main_Load(EOS(STATIC_1427), i310, i224, java.lang.Object(ARRAY(i224))) → 1429_0_main_Load(EOS(STATIC_1429), i310, i224, java.lang.Object(ARRAY(i224)), i310)
1469_0_main_GE(EOS(STATIC_1469), i310, i320, i224, java.lang.Object(ARRAY(i224)), i320, i224) → 1476_0_main_Load(EOS(STATIC_1476), i310, i320, i224, java.lang.Object(ARRAY(i224))) | <(i320, i224)
1476_0_main_Load(EOS(STATIC_1476), i310, i320, i224, java.lang.Object(ARRAY(i224))) → 1483_0_main_Load(EOS(STATIC_1483), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)))
1483_0_main_Load(EOS(STATIC_1483), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224))) → 1495_0_main_ArrayAccess(EOS(STATIC_1495), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310)
1495_0_main_ArrayAccess(EOS(STATIC_1495), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310) → 1643_0_main_ArrayAccess(EOS(STATIC_1643), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310)
1643_0_main_ArrayAccess(EOS(STATIC_1643), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310) → 1647_0_main_Load(EOS(STATIC_1647), i310, i320, i224, java.lang.Object(ARRAY(i224)), i396) | <(i310, i224)
1647_0_main_Load(EOS(STATIC_1647), i310, i320, i224, java.lang.Object(ARRAY(i224)), i396) → 1651_0_main_Load(EOS(STATIC_1651), i310, i320, i224, java.lang.Object(ARRAY(i224)), i396, java.lang.Object(ARRAY(i224)))
1651_0_main_Load(EOS(STATIC_1651), i310, i320, i224, java.lang.Object(ARRAY(i224)), i396, java.lang.Object(ARRAY(i224))) → 1655_0_main_ArrayAccess(EOS(STATIC_1655), i310, i320, i224, java.lang.Object(ARRAY(i224)), i396, java.lang.Object(ARRAY(i224)), i320)
1655_0_main_ArrayAccess(EOS(STATIC_1655), i310, i320, i224, java.lang.Object(ARRAY(i224)), i396, java.lang.Object(ARRAY(i224)), i320) → 1662_0_main_ArrayAccess(EOS(STATIC_1662), i310, i320, i224, java.lang.Object(ARRAY(i224)), i396, java.lang.Object(ARRAY(i224)), i320)
1662_0_main_ArrayAccess(EOS(STATIC_1662), i310, i320, i224, java.lang.Object(ARRAY(i224)), i396, java.lang.Object(ARRAY(i224)), i320) → 1670_0_main_GE(EOS(STATIC_1670), i310, i320, i224, java.lang.Object(ARRAY(i224)), i396, i400) | <(i320, i224)
1670_0_main_GE(EOS(STATIC_1670), i310, i320, i224, java.lang.Object(ARRAY(i224)), i396, i400) → 1676_0_main_GE(EOS(STATIC_1676), i310, i320, i224, java.lang.Object(ARRAY(i224)), i396, i400)
1670_0_main_GE(EOS(STATIC_1670), i310, i320, i224, java.lang.Object(ARRAY(i224)), i396, i400) → 1677_0_main_GE(EOS(STATIC_1677), i310, i320, i224, java.lang.Object(ARRAY(i224)), i396, i400)
1676_0_main_GE(EOS(STATIC_1676), i310, i320, i224, java.lang.Object(ARRAY(i224)), i396, i400) → 1687_0_main_Inc(EOS(STATIC_1687), i310, i320, i224, java.lang.Object(ARRAY(i224))) | >=(i396, i400)
1687_0_main_Inc(EOS(STATIC_1687), i310, i320, i224, java.lang.Object(ARRAY(i224))) → 2050_0_main_Inc(EOS(STATIC_2050), i310, i320, i224, java.lang.Object(ARRAY(i224)))
2050_0_main_Inc(EOS(STATIC_2050), i310, i320, i224, java.lang.Object(ARRAY(i224))) → 2073_0_main_JMP(EOS(STATIC_2073), i310, +(i320, 1), i224, java.lang.Object(ARRAY(i224))) | >(i320, 0)
2073_0_main_JMP(EOS(STATIC_2073), i310, i670, i224, java.lang.Object(ARRAY(i224))) → 2095_0_main_Load(EOS(STATIC_2095), i310, i670, i224, java.lang.Object(ARRAY(i224)))
2095_0_main_Load(EOS(STATIC_2095), i310, i670, i224, java.lang.Object(ARRAY(i224))) → 1455_0_main_Load(EOS(STATIC_1455), i310, i670, i224, java.lang.Object(ARRAY(i224)))
1677_0_main_GE(EOS(STATIC_1677), i310, i320, i224, java.lang.Object(ARRAY(i224)), i396, i400) → 1689_0_main_Load(EOS(STATIC_1689), i310, i320, i224, java.lang.Object(ARRAY(i224))) | <(i396, i400)
1689_0_main_Load(EOS(STATIC_1689), i310, i320, i224, java.lang.Object(ARRAY(i224))) → 1698_0_main_Load(EOS(STATIC_1698), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)))
1698_0_main_Load(EOS(STATIC_1698), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224))) → 1706_0_main_ArrayAccess(EOS(STATIC_1706), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310)
1706_0_main_ArrayAccess(EOS(STATIC_1706), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310) → 1842_0_main_ArrayAccess(EOS(STATIC_1842), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310)
1842_0_main_ArrayAccess(EOS(STATIC_1842), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310) → 1853_0_main_Store(EOS(STATIC_1853), i310, i320, i224, java.lang.Object(ARRAY(i224))) | <(i310, i224)
1853_0_main_Store(EOS(STATIC_1853), i310, i320, i224, java.lang.Object(ARRAY(i224))) → 1861_0_main_Load(EOS(STATIC_1861), i310, i320, i224, java.lang.Object(ARRAY(i224)))
1861_0_main_Load(EOS(STATIC_1861), i310, i320, i224, java.lang.Object(ARRAY(i224))) → 1871_0_main_Load(EOS(STATIC_1871), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)))
1871_0_main_Load(EOS(STATIC_1871), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224))) → 1888_0_main_Load(EOS(STATIC_1888), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310)
1888_0_main_Load(EOS(STATIC_1888), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310) → 1898_0_main_Load(EOS(STATIC_1898), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310, java.lang.Object(ARRAY(i224)))
1898_0_main_Load(EOS(STATIC_1898), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310, java.lang.Object(ARRAY(i224))) → 1905_0_main_ArrayAccess(EOS(STATIC_1905), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310, java.lang.Object(ARRAY(i224)), i320)
1905_0_main_ArrayAccess(EOS(STATIC_1905), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310, java.lang.Object(ARRAY(i224)), i320) → 1920_0_main_ArrayAccess(EOS(STATIC_1920), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310, java.lang.Object(ARRAY(i224)), i320)
1920_0_main_ArrayAccess(EOS(STATIC_1920), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310, java.lang.Object(ARRAY(i224)), i320) → 1930_0_main_ArrayAccess(EOS(STATIC_1930), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310) | <(i320, i224)
1930_0_main_ArrayAccess(EOS(STATIC_1930), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310) → 1939_0_main_ArrayAccess(EOS(STATIC_1939), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310)
1939_0_main_ArrayAccess(EOS(STATIC_1939), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i310) → 1958_0_main_Load(EOS(STATIC_1958), i310, i320, i224, java.lang.Object(ARRAY(i224))) | <(i310, i224)
1958_0_main_Load(EOS(STATIC_1958), i310, i320, i224, java.lang.Object(ARRAY(i224))) → 1978_0_main_Load(EOS(STATIC_1978), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)))
1978_0_main_Load(EOS(STATIC_1978), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224))) → 1992_0_main_Load(EOS(STATIC_1992), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i320)
1992_0_main_Load(EOS(STATIC_1992), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i320) → 2016_0_main_ArrayAccess(EOS(STATIC_2016), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i320)
2016_0_main_ArrayAccess(EOS(STATIC_2016), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i320) → 2037_0_main_ArrayAccess(EOS(STATIC_2037), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i320)
2037_0_main_ArrayAccess(EOS(STATIC_2037), i310, i320, i224, java.lang.Object(ARRAY(i224)), java.lang.Object(ARRAY(i224)), i320) → 2050_0_main_Inc(EOS(STATIC_2050), i310, i320, i224, java.lang.Object(ARRAY(i224))) | <(i320, i224)
R rules:

Combined rules. Obtained 2 conditional rules for P and 0 conditional rules for R.

P rules:
1463_0_main_GE(EOS(STATIC_1463), x0, x1, x2, java.lang.Object(ARRAY(x2)), x1, x2) → 1463_0_main_GE(EOS(STATIC_1463), +(x0, 1), +(x0, 2), x2, java.lang.Object(ARRAY(x2)), +(x0, 2), x2) | &&(&&(&&(>(+(x2, 1), 0), <=(x2, x1)), >(+(x0, 1), 0)), >(-(x2, 1), +(x0, 1)))
1463_0_main_GE(EOS(STATIC_1463), x0, x1, x2, java.lang.Object(ARRAY(x2)), x1, x2) → 1463_0_main_GE(EOS(STATIC_1463), x0, +(x1, 1), x2, java.lang.Object(ARRAY(x2)), +(x1, 1), x2) | &&(&&(>(x2, x1), >(x2, x0)), >(x1, 0))
R rules:

Filtered ground terms:

1463_0_main_GE(x1, x2, x3, x4, x5, x6, x7) → 1463_0_main_GE(x2, x3, x4, x5, x6, x7)
EOS(x1) → EOS
Cond_1463_0_main_GE1(x1, x2, x3, x4, x5, x6, x7, x8) → Cond_1463_0_main_GE1(x1, x3, x4, x5, x6, x7, x8)
Cond_1463_0_main_GE(x1, x2, x3, x4, x5, x6, x7, x8) → Cond_1463_0_main_GE(x1, x3, x4, x5, x6, x7, x8)

Filtered duplicate args:

1463_0_main_GE(x1, x2, x3, x4, x5, x6) → 1463_0_main_GE(x1, x4, x5)
Cond_1463_0_main_GE(x1, x2, x3, x4, x5, x6, x7) → Cond_1463_0_main_GE(x1, x2, x5, x6)
Cond_1463_0_main_GE1(x1, x2, x3, x4, x5, x6, x7) → Cond_1463_0_main_GE1(x1, x2, x5, x6)

Filtered unneeded arguments:

Cond_1463_0_main_GE(x1, x2, x3, x4) → Cond_1463_0_main_GE(x1, x2, x3)

Combined rules. Obtained 2 conditional rules for P and 0 conditional rules for R.

P rules:
1463_0_main_GE(x0, java.lang.Object(ARRAY(x2)), x1) → 1463_0_main_GE(+(x0, 1), java.lang.Object(ARRAY(x2)), +(x0, 2)) | &&(&&(&&(>(x2, -1), <=(x2, x1)), >(x0, -1)), >(-(x2, 1), +(x0, 1)))
1463_0_main_GE(x0, java.lang.Object(ARRAY(x2)), x1) → 1463_0_main_GE(x0, java.lang.Object(ARRAY(x2)), +(x1, 1)) | &&(&&(>(x2, x1), >(x2, x0)), >(x1, 0))
R rules:

Finished conversion. Obtained 4 rules for P and 0 rules for R. System has predefined symbols.

P rules:
1463_0_MAIN_GE(x0, java.lang.Object(ARRAY(x2)), x1) → COND_1463_0_MAIN_GE(&&(&&(&&(>(x2, -1), <=(x2, x1)), >(x0, -1)), >(-(x2, 1), +(x0, 1))), x0, java.lang.Object(ARRAY(x2)), x1)
COND_1463_0_MAIN_GE(TRUE, x0, java.lang.Object(ARRAY(x2)), x1) → 1463_0_MAIN_GE(+(x0, 1), java.lang.Object(ARRAY(x2)), +(x0, 2))
1463_0_MAIN_GE(x0, java.lang.Object(ARRAY(x2)), x1) → COND_1463_0_MAIN_GE1(&&(&&(>(x2, x1), >(x2, x0)), >(x1, 0)), x0, java.lang.Object(ARRAY(x2)), x1)
COND_1463_0_MAIN_GE1(TRUE, x0, java.lang.Object(ARRAY(x2)), x1) → 1463_0_MAIN_GE(x0, java.lang.Object(ARRAY(x2)), +(x1, 1))
R rules:

(18) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Boolean, Integer

R is empty.

The integer pair graph contains the following rules and edges:
(0): 1463_0_MAIN_GE(x0[0], java.lang.Object(ARRAY(x2[0])), x1[0]) → COND_1463_0_MAIN_GE(x2[0] > -1 && x2[0] <= x1[0] && x0[0] > -1 && x2[0] - 1 > x0[0] + 1, x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])
(1): COND_1463_0_MAIN_GE(TRUE, x0[1], java.lang.Object(ARRAY(x2[1])), x1[1]) → 1463_0_MAIN_GE(x0[1] + 1, java.lang.Object(ARRAY(x2[1])), x0[1] + 2)
(2): 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(x2[2] > x1[2] && x2[2] > x0[2] && x1[2] > 0, x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])
(3): COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3]) → 1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), x1[3] + 1)

(0) -> (1), if (x2[0] > -1 && x2[0] <= x1[0] && x0[0] > -1 && x2[0] - 1 > x0[0] + 1 ∧x0[0] →^* x0[1]∧java.lang.Object(ARRAY(x2[0])) →^* java.lang.Object(ARRAY(x2[1]))∧x1[0] →^* x1[1])

(1) -> (0), if (x0[1] + 1 →^* x0[0]∧java.lang.Object(ARRAY(x2[1])) →^* java.lang.Object(ARRAY(x2[0]))∧x0[1] + 2 →^* x1[0])

(1) -> (2), if (x0[1] + 1 →^* x0[2]∧java.lang.Object(ARRAY(x2[1])) →^* java.lang.Object(ARRAY(x2[2]))∧x0[1] + 2 →^* x1[2])

(2) -> (3), if (x2[2] > x1[2] && x2[2] > x0[2] && x1[2] > 0 ∧x0[2] →^* x0[3]∧java.lang.Object(ARRAY(x2[2])) →^* java.lang.Object(ARRAY(x2[3]))∧x1[2] →^* x1[3])

(3) -> (0), if (x0[3] →^* x0[0]∧java.lang.Object(ARRAY(x2[3])) →^* java.lang.Object(ARRAY(x2[0]))∧x1[3] + 1 →^* x1[0])

(3) -> (2), if (x0[3] →^* x0[2]∧java.lang.Object(ARRAY(x2[3])) →^* java.lang.Object(ARRAY(x2[2]))∧x1[3] + 1 →^* x1[2])

The set Q is empty.

(19) IDPNonInfProof (SOUND transformation)

Used the following options for this NonInfProof:
IDPGPoloSolver: Range: [(-1,2)] IsNat: false Interpretation Shape Heuristic: aprove.DPFramework.IDPProblem.Processors.nonInf.poly.IdpDefaultShapeHeuristic@79098e02 Constraint Generator: NonInfConstraintGenerator: PathGenerator: MetricPathGenerator: Max Left Steps: 1 Max Right Steps: 1

The constraints were generated the following way:
The DP Problem is simplified using the Induction Calculus [NONINF] with the following steps:
Note that final constraints are written in bold face.

For Pair 1463_0_MAIN_GE(x0, java.lang.Object(ARRAY(x2)), x1) → COND_1463_0_MAIN_GE(&&(&&(&&(>(x2, -1), <=(x2, x1)), >(x0, -1)), >(-(x2, 1), +(x0, 1))), x0, java.lang.Object(ARRAY(x2)), x1) the following chains were created:

We consider the chain 1463_0_MAIN_GE(x0[0], java.lang.Object(ARRAY(x2[0])), x1[0]) → COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0]), COND_1463_0_MAIN_GE(TRUE, x0[1], java.lang.Object(ARRAY(x2[1])), x1[1]) → 1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2)) which results in the following constraint:
(1)    (&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1)))=TRUE∧x0[0]=x0[1]∧java.lang.Object(ARRAY(x2[0]))=java.lang.Object(ARRAY(x2[1]))∧x1[0]=x1[1] ⇒ 1463_0_MAIN_GE(x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])≥NonInfC∧1463_0_MAIN_GE(x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])≥COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])∧(U^Increasing(COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])), ≥))

We simplified constraint (1) using rules (I), (II), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(2)    (>(-(x2[0], 1), +(x0[0], 1))=TRUE∧>(x0[0], -1)=TRUE∧>(x2[0], -1)=TRUE∧<=(x2[0], x1[0])=TRUE ⇒ 1463_0_MAIN_GE(x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])≥NonInfC∧1463_0_MAIN_GE(x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])≥COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])∧(U^Increasing(COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])), ≥))

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(3)    (x2[0] + [-3] + [-1]x0[0] ≥ 0∧x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])), ≥)∧[bni_24 + (-1)Bound*bni_24] + [bni_24]x2[0] + [(-1)bni_24]x0[0] ≥ 0∧[(-1)bso_25] ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(4)    (x2[0] + [-3] + [-1]x0[0] ≥ 0∧x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])), ≥)∧[bni_24 + (-1)Bound*bni_24] + [bni_24]x2[0] + [(-1)bni_24]x0[0] ≥ 0∧[(-1)bso_25] ≥ 0)

We simplified constraint (4) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(5)    (x2[0] + [-3] + [-1]x0[0] ≥ 0∧x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])), ≥)∧[bni_24 + (-1)Bound*bni_24] + [bni_24]x2[0] + [(-1)bni_24]x0[0] ≥ 0∧[(-1)bso_25] ≥ 0)

We simplified constraint (5) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(6)    (x2[0] ≥ 0∧x0[0] ≥ 0∧[3] + x0[0] + x2[0] ≥ 0∧x1[0] + [-3] + [-1]x0[0] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])), ≥)∧[(4)bni_24 + (-1)Bound*bni_24] + [bni_24]x2[0] ≥ 0∧[(-1)bso_25] ≥ 0)

We simplified constraint (6) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(7)    (x2[0] ≥ 0∧x0[0] ≥ 0∧[3] + x0[0] + x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])), ≥)∧[(4)bni_24 + (-1)Bound*bni_24] + [bni_24]x2[0] ≥ 0∧[(-1)bso_25] ≥ 0)

For Pair COND_1463_0_MAIN_GE(TRUE, x0, java.lang.Object(ARRAY(x2)), x1) → 1463_0_MAIN_GE(+(x0, 1), java.lang.Object(ARRAY(x2)), +(x0, 2)) the following chains were created:

We consider the chain 1463_0_MAIN_GE(x0[0], java.lang.Object(ARRAY(x2[0])), x1[0]) → COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0]), COND_1463_0_MAIN_GE(TRUE, x0[1], java.lang.Object(ARRAY(x2[1])), x1[1]) → 1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2)), 1463_0_MAIN_GE(x0[0], java.lang.Object(ARRAY(x2[0])), x1[0]) → COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0]) which results in the following constraint:
(8)    (&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1)))=TRUE∧x0[0]=x0[1]∧java.lang.Object(ARRAY(x2[0]))=java.lang.Object(ARRAY(x2[1]))∧x1[0]=x1[1]∧+(x0[1], 1)=x0[0]1∧java.lang.Object(ARRAY(x2[1]))=java.lang.Object(ARRAY(x2[0]1))∧+(x0[1], 2)=x1[0]1 ⇒ COND_1463_0_MAIN_GE(TRUE, x0[1], java.lang.Object(ARRAY(x2[1])), x1[1])≥NonInfC∧COND_1463_0_MAIN_GE(TRUE, x0[1], java.lang.Object(ARRAY(x2[1])), x1[1])≥1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))∧(U^Increasing(1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))), ≥))

We simplified constraint (8) using rules (I), (II), (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(9)    (>(-(x2[0], 1), +(x0[0], 1))=TRUE∧>(x0[0], -1)=TRUE∧>(x2[0], -1)=TRUE∧<=(x2[0], x1[0])=TRUE ⇒ COND_1463_0_MAIN_GE(TRUE, x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])≥NonInfC∧COND_1463_0_MAIN_GE(TRUE, x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])≥1463_0_MAIN_GE(+(x0[0], 1), java.lang.Object(ARRAY(x2[0])), +(x0[0], 2))∧(U^Increasing(1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))), ≥))

We simplified constraint (9) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(10)    (x2[0] + [-3] + [-1]x0[0] ≥ 0∧x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))), ≥)∧[bni_26 + (-1)Bound*bni_26] + [bni_26]x2[0] + [(-1)bni_26]x0[0] ≥ 0∧[1 + (-1)bso_27] ≥ 0)

We simplified constraint (10) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(11)    (x2[0] + [-3] + [-1]x0[0] ≥ 0∧x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))), ≥)∧[bni_26 + (-1)Bound*bni_26] + [bni_26]x2[0] + [(-1)bni_26]x0[0] ≥ 0∧[1 + (-1)bso_27] ≥ 0)

We simplified constraint (11) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(12)    (x2[0] + [-3] + [-1]x0[0] ≥ 0∧x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))), ≥)∧[bni_26 + (-1)Bound*bni_26] + [bni_26]x2[0] + [(-1)bni_26]x0[0] ≥ 0∧[1 + (-1)bso_27] ≥ 0)

We simplified constraint (12) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(13)    (x2[0] ≥ 0∧x0[0] ≥ 0∧[3] + x0[0] + x2[0] ≥ 0∧x1[0] + [-3] + [-1]x0[0] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))), ≥)∧[(4)bni_26 + (-1)Bound*bni_26] + [bni_26]x2[0] ≥ 0∧[1 + (-1)bso_27] ≥ 0)

We simplified constraint (13) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(14)    (x2[0] ≥ 0∧x0[0] ≥ 0∧[3] + x0[0] + x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))), ≥)∧[(4)bni_26 + (-1)Bound*bni_26] + [bni_26]x2[0] ≥ 0∧[1 + (-1)bso_27] ≥ 0)
We consider the chain 1463_0_MAIN_GE(x0[0], java.lang.Object(ARRAY(x2[0])), x1[0]) → COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0]), COND_1463_0_MAIN_GE(TRUE, x0[1], java.lang.Object(ARRAY(x2[1])), x1[1]) → 1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2)), 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) which results in the following constraint:
(15)    (&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1)))=TRUE∧x0[0]=x0[1]∧java.lang.Object(ARRAY(x2[0]))=java.lang.Object(ARRAY(x2[1]))∧x1[0]=x1[1]∧+(x0[1], 1)=x0[2]∧java.lang.Object(ARRAY(x2[1]))=java.lang.Object(ARRAY(x2[2]))∧+(x0[1], 2)=x1[2] ⇒ COND_1463_0_MAIN_GE(TRUE, x0[1], java.lang.Object(ARRAY(x2[1])), x1[1])≥NonInfC∧COND_1463_0_MAIN_GE(TRUE, x0[1], java.lang.Object(ARRAY(x2[1])), x1[1])≥1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))∧(U^Increasing(1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))), ≥))

We simplified constraint (15) using rules (I), (II), (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(16)    (>(-(x2[0], 1), +(x0[0], 1))=TRUE∧>(x0[0], -1)=TRUE∧>(x2[0], -1)=TRUE∧<=(x2[0], x1[0])=TRUE ⇒ COND_1463_0_MAIN_GE(TRUE, x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])≥NonInfC∧COND_1463_0_MAIN_GE(TRUE, x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])≥1463_0_MAIN_GE(+(x0[0], 1), java.lang.Object(ARRAY(x2[0])), +(x0[0], 2))∧(U^Increasing(1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))), ≥))

We simplified constraint (16) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(17)    (x2[0] + [-3] + [-1]x0[0] ≥ 0∧x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))), ≥)∧[bni_26 + (-1)Bound*bni_26] + [bni_26]x2[0] + [(-1)bni_26]x0[0] ≥ 0∧[1 + (-1)bso_27] ≥ 0)

We simplified constraint (17) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(18)    (x2[0] + [-3] + [-1]x0[0] ≥ 0∧x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))), ≥)∧[bni_26 + (-1)Bound*bni_26] + [bni_26]x2[0] + [(-1)bni_26]x0[0] ≥ 0∧[1 + (-1)bso_27] ≥ 0)

We simplified constraint (18) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(19)    (x2[0] + [-3] + [-1]x0[0] ≥ 0∧x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))), ≥)∧[bni_26 + (-1)Bound*bni_26] + [bni_26]x2[0] + [(-1)bni_26]x0[0] ≥ 0∧[1 + (-1)bso_27] ≥ 0)

We simplified constraint (19) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(20)    (x2[0] ≥ 0∧x0[0] ≥ 0∧[3] + x0[0] + x2[0] ≥ 0∧x1[0] + [-3] + [-1]x0[0] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))), ≥)∧[(4)bni_26 + (-1)Bound*bni_26] + [bni_26]x2[0] ≥ 0∧[1 + (-1)bso_27] ≥ 0)

We simplified constraint (20) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(21)    (x2[0] ≥ 0∧x0[0] ≥ 0∧[3] + x0[0] + x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))), ≥)∧[(4)bni_26 + (-1)Bound*bni_26] + [bni_26]x2[0] ≥ 0∧[1 + (-1)bso_27] ≥ 0)

For Pair 1463_0_MAIN_GE(x0, java.lang.Object(ARRAY(x2)), x1) → COND_1463_0_MAIN_GE1(&&(&&(>(x2, x1), >(x2, x0)), >(x1, 0)), x0, java.lang.Object(ARRAY(x2)), x1) the following chains were created:

We consider the chain 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]), COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3]) → 1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1)) which results in the following constraint:
(22)    (&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0))=TRUE∧x0[2]=x0[3]∧java.lang.Object(ARRAY(x2[2]))=java.lang.Object(ARRAY(x2[3]))∧x1[2]=x1[3] ⇒ 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])≥NonInfC∧1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])≥COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])∧(U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥))

We simplified constraint (22) using rules (I), (II), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(23)    (>(x1[2], 0)=TRUE∧>(x2[2], x1[2])=TRUE∧>(x2[2], x0[2])=TRUE ⇒ 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])≥NonInfC∧1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])≥COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])∧(U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥))

We simplified constraint (23) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(24)    (x1[2] + [-1] ≥ 0∧x2[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[bni_28 + (-1)Bound*bni_28] + [bni_28]x2[2] + [(-1)bni_28]x0[2] ≥ 0∧[(-1)bso_29] ≥ 0)

We simplified constraint (24) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(25)    (x1[2] + [-1] ≥ 0∧x2[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[bni_28 + (-1)Bound*bni_28] + [bni_28]x2[2] + [(-1)bni_28]x0[2] ≥ 0∧[(-1)bso_29] ≥ 0)

We simplified constraint (25) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(26)    (x1[2] + [-1] ≥ 0∧x2[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[bni_28 + (-1)Bound*bni_28] + [bni_28]x2[2] + [(-1)bni_28]x0[2] ≥ 0∧[(-1)bso_29] ≥ 0)

We simplified constraint (26) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(27)    (x1[2] ≥ 0∧x2[2] + [-2] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[bni_28 + (-1)Bound*bni_28] + [bni_28]x2[2] + [(-1)bni_28]x0[2] ≥ 0∧[(-1)bso_29] ≥ 0)

We simplified constraint (27) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(28)    (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[(3)bni_28 + (-1)Bound*bni_28] + [bni_28]x1[2] + [bni_28]x2[2] + [(-1)bni_28]x0[2] ≥ 0∧[(-1)bso_29] ≥ 0)

We simplified constraint (28) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(29)    (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + [-1]x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[(3)bni_28 + (-1)Bound*bni_28] + [bni_28]x1[2] + [bni_28]x2[2] + [(-1)bni_28]x0[2] ≥ 0∧[(-1)bso_29] ≥ 0)

(30)    (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[(3)bni_28 + (-1)Bound*bni_28] + [bni_28]x1[2] + [bni_28]x2[2] + [bni_28]x0[2] ≥ 0∧[(-1)bso_29] ≥ 0)

For Pair COND_1463_0_MAIN_GE1(TRUE, x0, java.lang.Object(ARRAY(x2)), x1) → 1463_0_MAIN_GE(x0, java.lang.Object(ARRAY(x2)), +(x1, 1)) the following chains were created:

We consider the chain 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]), COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3]) → 1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1)), 1463_0_MAIN_GE(x0[0], java.lang.Object(ARRAY(x2[0])), x1[0]) → COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0]) which results in the following constraint:
(31)    (&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0))=TRUE∧x0[2]=x0[3]∧java.lang.Object(ARRAY(x2[2]))=java.lang.Object(ARRAY(x2[3]))∧x1[2]=x1[3]∧x0[3]=x0[0]∧java.lang.Object(ARRAY(x2[3]))=java.lang.Object(ARRAY(x2[0]))∧+(x1[3], 1)=x1[0] ⇒ COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3])≥NonInfC∧COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3])≥1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))∧(U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥))

We simplified constraint (31) using rules (I), (II), (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(32)    (>(x1[2], 0)=TRUE∧>(x2[2], x1[2])=TRUE∧>(x2[2], x0[2])=TRUE ⇒ COND_1463_0_MAIN_GE1(TRUE, x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])≥NonInfC∧COND_1463_0_MAIN_GE1(TRUE, x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])≥1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), +(x1[2], 1))∧(U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥))

We simplified constraint (32) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(33)    (x1[2] + [-1] ≥ 0∧x2[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[bni_30 + (-1)Bound*bni_30] + [bni_30]x2[2] + [(-1)bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)

We simplified constraint (33) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(34)    (x1[2] + [-1] ≥ 0∧x2[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[bni_30 + (-1)Bound*bni_30] + [bni_30]x2[2] + [(-1)bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)

We simplified constraint (34) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(35)    (x1[2] + [-1] ≥ 0∧x2[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[bni_30 + (-1)Bound*bni_30] + [bni_30]x2[2] + [(-1)bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)

We simplified constraint (35) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(36)    (x1[2] ≥ 0∧x2[2] + [-2] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[bni_30 + (-1)Bound*bni_30] + [bni_30]x2[2] + [(-1)bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)

We simplified constraint (36) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(37)    (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(3)bni_30 + (-1)Bound*bni_30] + [bni_30]x1[2] + [bni_30]x2[2] + [(-1)bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)

We simplified constraint (37) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(38)    (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(3)bni_30 + (-1)Bound*bni_30] + [bni_30]x1[2] + [bni_30]x2[2] + [bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)

(39)    (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + [-1]x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(3)bni_30 + (-1)Bound*bni_30] + [bni_30]x1[2] + [bni_30]x2[2] + [(-1)bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)
We consider the chain 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]), COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3]) → 1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1)), 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) which results in the following constraint:
(40)    (&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0))=TRUE∧x0[2]=x0[3]∧java.lang.Object(ARRAY(x2[2]))=java.lang.Object(ARRAY(x2[3]))∧x1[2]=x1[3]∧x0[3]=x0[2]1∧java.lang.Object(ARRAY(x2[3]))=java.lang.Object(ARRAY(x2[2]1))∧+(x1[3], 1)=x1[2]1 ⇒ COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3])≥NonInfC∧COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3])≥1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))∧(U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥))

We simplified constraint (40) using rules (I), (II), (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(41)    (>(x1[2], 0)=TRUE∧>(x2[2], x1[2])=TRUE∧>(x2[2], x0[2])=TRUE ⇒ COND_1463_0_MAIN_GE1(TRUE, x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])≥NonInfC∧COND_1463_0_MAIN_GE1(TRUE, x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])≥1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), +(x1[2], 1))∧(U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥))

We simplified constraint (41) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(42)    (x1[2] + [-1] ≥ 0∧x2[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[bni_30 + (-1)Bound*bni_30] + [bni_30]x2[2] + [(-1)bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)

We simplified constraint (42) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(43)    (x1[2] + [-1] ≥ 0∧x2[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[bni_30 + (-1)Bound*bni_30] + [bni_30]x2[2] + [(-1)bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)

We simplified constraint (43) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(44)    (x1[2] + [-1] ≥ 0∧x2[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[bni_30 + (-1)Bound*bni_30] + [bni_30]x2[2] + [(-1)bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)

We simplified constraint (44) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(45)    (x1[2] ≥ 0∧x2[2] + [-2] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[bni_30 + (-1)Bound*bni_30] + [bni_30]x2[2] + [(-1)bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)

We simplified constraint (45) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(46)    (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(3)bni_30 + (-1)Bound*bni_30] + [bni_30]x1[2] + [bni_30]x2[2] + [(-1)bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)

We simplified constraint (46) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(47)    (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(3)bni_30 + (-1)Bound*bni_30] + [bni_30]x1[2] + [bni_30]x2[2] + [bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)

(48)    (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + [-1]x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(3)bni_30 + (-1)Bound*bni_30] + [bni_30]x1[2] + [bni_30]x2[2] + [(-1)bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)

To summarize, we get the following constraints P_≥ for the following pairs.

1463_0_MAIN_GE(x0, java.lang.Object(ARRAY(x2)), x1) → COND_1463_0_MAIN_GE(&&(&&(&&(>(x2, -1), <=(x2, x1)), >(x0, -1)), >(-(x2, 1), +(x0, 1))), x0, java.lang.Object(ARRAY(x2)), x1)
- (x2[0] ≥ 0∧x0[0] ≥ 0∧[3] + x0[0] + x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])), ≥)∧[(4)bni_24 + (-1)Bound*bni_24] + [bni_24]x2[0] ≥ 0∧[(-1)bso_25] ≥ 0)
COND_1463_0_MAIN_GE(TRUE, x0, java.lang.Object(ARRAY(x2)), x1) → 1463_0_MAIN_GE(+(x0, 1), java.lang.Object(ARRAY(x2)), +(x0, 2))
- (x2[0] ≥ 0∧x0[0] ≥ 0∧[3] + x0[0] + x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))), ≥)∧[(4)bni_26 + (-1)Bound*bni_26] + [bni_26]x2[0] ≥ 0∧[1 + (-1)bso_27] ≥ 0)
- (x2[0] ≥ 0∧x0[0] ≥ 0∧[3] + x0[0] + x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))), ≥)∧[(4)bni_26 + (-1)Bound*bni_26] + [bni_26]x2[0] ≥ 0∧[1 + (-1)bso_27] ≥ 0)
1463_0_MAIN_GE(x0, java.lang.Object(ARRAY(x2)), x1) → COND_1463_0_MAIN_GE1(&&(&&(>(x2, x1), >(x2, x0)), >(x1, 0)), x0, java.lang.Object(ARRAY(x2)), x1)
- (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + [-1]x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[(3)bni_28 + (-1)Bound*bni_28] + [bni_28]x1[2] + [bni_28]x2[2] + [(-1)bni_28]x0[2] ≥ 0∧[(-1)bso_29] ≥ 0)
- (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[(3)bni_28 + (-1)Bound*bni_28] + [bni_28]x1[2] + [bni_28]x2[2] + [bni_28]x0[2] ≥ 0∧[(-1)bso_29] ≥ 0)
COND_1463_0_MAIN_GE1(TRUE, x0, java.lang.Object(ARRAY(x2)), x1) → 1463_0_MAIN_GE(x0, java.lang.Object(ARRAY(x2)), +(x1, 1))
- (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(3)bni_30 + (-1)Bound*bni_30] + [bni_30]x1[2] + [bni_30]x2[2] + [bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)
- (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + [-1]x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(3)bni_30 + (-1)Bound*bni_30] + [bni_30]x1[2] + [bni_30]x2[2] + [(-1)bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)
- (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(3)bni_30 + (-1)Bound*bni_30] + [bni_30]x1[2] + [bni_30]x2[2] + [bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)
- (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + [-1]x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(3)bni_30 + (-1)Bound*bni_30] + [bni_30]x1[2] + [bni_30]x2[2] + [(-1)bni_30]x0[2] ≥ 0∧[(-1)bso_31] ≥ 0)

POL(TRUE) = 0
POL(FALSE) = [2]
POL(1463_0_MAIN_GE(x₁, x₂, x₃)) = [-1] + [-1]x₂ + [-1]x₁
POL(java.lang.Object(x₁)) = [-1] + x₁
POL(ARRAY(x₁)) = [-1] + [-1]x₁
POL(COND_1463_0_MAIN_GE(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₃ + [-1]x₂
POL(&&(x₁, x₂)) = [-1]
POL(>(x₁, x₂)) = [-1]
POL(-1) = [-1]
POL(<=(x₁, x₂)) = [-1]
POL(-(x₁, x₂)) = x₁ + [-1]x₂
POL(1) = [1]
POL(+(x₁, x₂)) = x₁ + x₂
POL(2) = [2]
POL(COND_1463_0_MAIN_GE1(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₃ + [-1]x₂
POL(0) = 0

The following pairs are in P_>:

COND_1463_0_MAIN_GE(TRUE, x0[1], java.lang.Object(ARRAY(x2[1])), x1[1]) → 1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))

The following pairs are in P_bound:

1463_0_MAIN_GE(x0[0], java.lang.Object(ARRAY(x2[0])), x1[0]) → COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])
COND_1463_0_MAIN_GE(TRUE, x0[1], java.lang.Object(ARRAY(x2[1])), x1[1]) → 1463_0_MAIN_GE(+(x0[1], 1), java.lang.Object(ARRAY(x2[1])), +(x0[1], 2))
1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])
COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3]) → 1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))

The following pairs are in P_≥:

1463_0_MAIN_GE(x0[0], java.lang.Object(ARRAY(x2[0])), x1[0]) → COND_1463_0_MAIN_GE(&&(&&(&&(>(x2[0], -1), <=(x2[0], x1[0])), >(x0[0], -1)), >(-(x2[0], 1), +(x0[0], 1))), x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])
1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])
COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3]) → 1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))

At least the following rules have been oriented under context sensitive arithmetic replacement:

TRUE¹ → &&(TRUE, TRUE)¹
FALSE¹ → &&(TRUE, FALSE)¹
FALSE¹ → &&(FALSE, TRUE)¹
FALSE¹ → &&(FALSE, FALSE)¹

(20) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Boolean, Integer

R is empty.

The integer pair graph contains the following rules and edges:
(0): 1463_0_MAIN_GE(x0[0], java.lang.Object(ARRAY(x2[0])), x1[0]) → COND_1463_0_MAIN_GE(x2[0] > -1 && x2[0] <= x1[0] && x0[0] > -1 && x2[0] - 1 > x0[0] + 1, x0[0], java.lang.Object(ARRAY(x2[0])), x1[0])
(2): 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(x2[2] > x1[2] && x2[2] > x0[2] && x1[2] > 0, x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])
(3): COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3]) → 1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), x1[3] + 1)

(3) -> (0), if (x0[3] →^* x0[0]∧java.lang.Object(ARRAY(x2[3])) →^* java.lang.Object(ARRAY(x2[0]))∧x1[3] + 1 →^* x1[0])

(3) -> (2), if (x0[3] →^* x0[2]∧java.lang.Object(ARRAY(x2[3])) →^* java.lang.Object(ARRAY(x2[2]))∧x1[3] + 1 →^* x1[2])

(2) -> (3), if (x2[2] > x1[2] && x2[2] > x0[2] && x1[2] > 0 ∧x0[2] →^* x0[3]∧java.lang.Object(ARRAY(x2[2])) →^* java.lang.Object(ARRAY(x2[3]))∧x1[2] →^* x1[3])

The set Q is empty.

(21) IDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.

(22) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Integer, Boolean

R is empty.

The integer pair graph contains the following rules and edges:
(3): COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3]) → 1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), x1[3] + 1)
(2): 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(x2[2] > x1[2] && x2[2] > x0[2] && x1[2] > 0, x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])

(3) -> (2), if (x0[3] →^* x0[2]∧java.lang.Object(ARRAY(x2[3])) →^* java.lang.Object(ARRAY(x2[2]))∧x1[3] + 1 →^* x1[2])

(2) -> (3), if (x2[2] > x1[2] && x2[2] > x0[2] && x1[2] > 0 ∧x0[2] →^* x0[3]∧java.lang.Object(ARRAY(x2[2])) →^* java.lang.Object(ARRAY(x2[3]))∧x1[2] →^* x1[3])

The set Q is empty.

(23) IDPNonInfProof (SOUND transformation)

Used the following options for this NonInfProof:
IDPGPoloSolver: Range: [(-1,2)] IsNat: false Interpretation Shape Heuristic: aprove.DPFramework.IDPProblem.Processors.nonInf.poly.IdpDefaultShapeHeuristic@79098e02 Constraint Generator: NonInfConstraintGenerator: PathGenerator: MetricPathGenerator: Max Left Steps: 1 Max Right Steps: 1

The constraints were generated the following way:
The DP Problem is simplified using the Induction Calculus [NONINF] with the following steps:
Note that final constraints are written in bold face.

For Pair COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3]) → 1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1)) the following chains were created:

We consider the chain 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]), COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3]) → 1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1)), 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) which results in the following constraint:
(1)    (&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0))=TRUE∧x0[2]=x0[3]∧java.lang.Object(ARRAY(x2[2]))=java.lang.Object(ARRAY(x2[3]))∧x1[2]=x1[3]∧x0[3]=x0[2]1∧java.lang.Object(ARRAY(x2[3]))=java.lang.Object(ARRAY(x2[2]1))∧+(x1[3], 1)=x1[2]1 ⇒ COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3])≥NonInfC∧COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3])≥1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))∧(U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥))

We simplified constraint (1) using rules (I), (II), (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(2)    (>(x1[2], 0)=TRUE∧>(x2[2], x1[2])=TRUE∧>(x2[2], x0[2])=TRUE ⇒ COND_1463_0_MAIN_GE1(TRUE, x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])≥NonInfC∧COND_1463_0_MAIN_GE1(TRUE, x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])≥1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), +(x1[2], 1))∧(U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥))

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(3)    (x1[2] + [-1] ≥ 0∧x2[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(-1)Bound*bni_18] + [(-1)bni_18]x1[2] + [(2)bni_18]x2[2] ≥ 0∧[1 + (-1)bso_19] ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(4)    (x1[2] + [-1] ≥ 0∧x2[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(-1)Bound*bni_18] + [(-1)bni_18]x1[2] + [(2)bni_18]x2[2] ≥ 0∧[1 + (-1)bso_19] ≥ 0)

We simplified constraint (4) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(5)    (x1[2] + [-1] ≥ 0∧x2[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(-1)Bound*bni_18] + [(-1)bni_18]x1[2] + [(2)bni_18]x2[2] ≥ 0∧[1 + (-1)bso_19] ≥ 0)

We simplified constraint (5) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(6)    (x1[2] ≥ 0∧x2[2] + [-2] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(-1)Bound*bni_18 + (-1)bni_18] + [(-1)bni_18]x1[2] + [(2)bni_18]x2[2] ≥ 0∧[1 + (-1)bso_19] ≥ 0)

We simplified constraint (6) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(7)    (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(-1)Bound*bni_18 + (3)bni_18] + [bni_18]x1[2] + [(2)bni_18]x2[2] ≥ 0∧[1 + (-1)bso_19] ≥ 0)

We simplified constraint (7) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(8)    (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + [-1]x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(-1)Bound*bni_18 + (3)bni_18] + [bni_18]x1[2] + [(2)bni_18]x2[2] ≥ 0∧[1 + (-1)bso_19] ≥ 0)

(9)    (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(-1)Bound*bni_18 + (3)bni_18] + [bni_18]x1[2] + [(2)bni_18]x2[2] ≥ 0∧[1 + (-1)bso_19] ≥ 0)

For Pair 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) the following chains were created:

We consider the chain 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]), COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3]) → 1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1)) which results in the following constraint:
(10)    (&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0))=TRUE∧x0[2]=x0[3]∧java.lang.Object(ARRAY(x2[2]))=java.lang.Object(ARRAY(x2[3]))∧x1[2]=x1[3] ⇒ 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])≥NonInfC∧1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])≥COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])∧(U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥))

We simplified constraint (10) using rules (I), (II), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(11)    (>(x1[2], 0)=TRUE∧>(x2[2], x1[2])=TRUE∧>(x2[2], x0[2])=TRUE ⇒ 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])≥NonInfC∧1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])≥COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])∧(U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥))

We simplified constraint (11) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(12)    (x1[2] + [-1] ≥ 0∧x2[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[(-1)Bound*bni_20] + [(-1)bni_20]x1[2] + [(2)bni_20]x2[2] ≥ 0∧[(-1)bso_21] ≥ 0)

We simplified constraint (12) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(13)    (x1[2] + [-1] ≥ 0∧x2[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[(-1)Bound*bni_20] + [(-1)bni_20]x1[2] + [(2)bni_20]x2[2] ≥ 0∧[(-1)bso_21] ≥ 0)

We simplified constraint (13) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(14)    (x1[2] + [-1] ≥ 0∧x2[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[(-1)Bound*bni_20] + [(-1)bni_20]x1[2] + [(2)bni_20]x2[2] ≥ 0∧[(-1)bso_21] ≥ 0)

We simplified constraint (14) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(15)    (x1[2] ≥ 0∧x2[2] + [-2] + [-1]x1[2] ≥ 0∧x2[2] + [-1] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[(-1)Bound*bni_20 + (-1)bni_20] + [(-1)bni_20]x1[2] + [(2)bni_20]x2[2] ≥ 0∧[(-1)bso_21] ≥ 0)

We simplified constraint (15) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(16)    (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + [-1]x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[(-1)Bound*bni_20 + (3)bni_20] + [bni_20]x1[2] + [(2)bni_20]x2[2] ≥ 0∧[(-1)bso_21] ≥ 0)

We simplified constraint (16) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(17)    (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + [-1]x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[(-1)Bound*bni_20 + (3)bni_20] + [bni_20]x1[2] + [(2)bni_20]x2[2] ≥ 0∧[(-1)bso_21] ≥ 0)

(18)    (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[(-1)Bound*bni_20 + (3)bni_20] + [bni_20]x1[2] + [(2)bni_20]x2[2] ≥ 0∧[(-1)bso_21] ≥ 0)

To summarize, we get the following constraints P_≥ for the following pairs.

COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3]) → 1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))
- (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + [-1]x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(-1)Bound*bni_18 + (3)bni_18] + [bni_18]x1[2] + [(2)bni_18]x2[2] ≥ 0∧[1 + (-1)bso_19] ≥ 0)
- (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))), ≥)∧[(-1)Bound*bni_18 + (3)bni_18] + [bni_18]x1[2] + [(2)bni_18]x2[2] ≥ 0∧[1 + (-1)bso_19] ≥ 0)
1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])
- (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + [-1]x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[(-1)Bound*bni_20 + (3)bni_20] + [bni_20]x1[2] + [(2)bni_20]x2[2] ≥ 0∧[(-1)bso_21] ≥ 0)
- (x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + x1[2] + x2[2] + x0[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])), ≥)∧[(-1)Bound*bni_20 + (3)bni_20] + [bni_20]x1[2] + [(2)bni_20]x2[2] ≥ 0∧[(-1)bso_21] ≥ 0)

POL(TRUE) = 0
POL(FALSE) = 0
POL(COND_1463_0_MAIN_GE1(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₄ + [-1]x₃ + [-1]x₁
POL(java.lang.Object(x₁)) = [1] + [2]x₁
POL(ARRAY(x₁)) = [-1] + [-1]x₁
POL(1463_0_MAIN_GE(x₁, x₂, x₃)) = [-1] + [-1]x₃ + [-1]x₂
POL(+(x₁, x₂)) = x₁ + x₂
POL(1) = [1]
POL(&&(x₁, x₂)) = 0
POL(>(x₁, x₂)) = [-1]
POL(0) = 0

The following pairs are in P_>:

COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3]) → 1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))

The following pairs are in P_bound:

COND_1463_0_MAIN_GE1(TRUE, x0[3], java.lang.Object(ARRAY(x2[3])), x1[3]) → 1463_0_MAIN_GE(x0[3], java.lang.Object(ARRAY(x2[3])), +(x1[3], 1))
1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])

The following pairs are in P_≥:

1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(&&(&&(>(x2[2], x1[2]), >(x2[2], x0[2])), >(x1[2], 0)), x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])

At least the following rules have been oriented under context sensitive arithmetic replacement:

&&(TRUE, TRUE)¹ ↔ TRUE¹
&&(TRUE, FALSE)¹ ↔ FALSE¹
&&(FALSE, TRUE)¹ ↔ FALSE¹
&&(FALSE, FALSE)¹ ↔ FALSE¹

(24) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Boolean, Integer

R is empty.

The integer pair graph contains the following rules and edges:
(2): 1463_0_MAIN_GE(x0[2], java.lang.Object(ARRAY(x2[2])), x1[2]) → COND_1463_0_MAIN_GE1(x2[2] > x1[2] && x2[2] > x0[2] && x1[2] > 0, x0[2], java.lang.Object(ARRAY(x2[2])), x1[2])

The set Q is empty.

(25) IDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.

(26) TRUE

(27) Obligation:

(28) SCCToIDPv1Proof (SOUND transformation)

Transformed FIGraph SCCs to IDPs. Log:

Generated 23 rules for P and 0 rules for R.

P rules:
737_0_main_Load(EOS(STATIC_737), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), i181) → 739_0_main_ConstantStackPush(EOS(STATIC_739), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), i181, i50)
739_0_main_ConstantStackPush(EOS(STATIC_739), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), i181, i50) → 741_0_main_IntArithmetic(EOS(STATIC_741), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), i181, i50, 1)
741_0_main_IntArithmetic(EOS(STATIC_741), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), i181, i50, matching1) → 743_0_main_GE(EOS(STATIC_743), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), i181, -(i50, 1)) | &&(>=(i50, 0), =(matching1, 1))
743_0_main_GE(EOS(STATIC_743), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), i181, i188) → 746_0_main_GE(EOS(STATIC_746), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), i181, i188)
746_0_main_GE(EOS(STATIC_746), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), i181, i188) → 750_0_main_Load(EOS(STATIC_750), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50))) | <(i181, i188)
750_0_main_Load(EOS(STATIC_750), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50))) → 754_0_main_Load(EOS(STATIC_754), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)))
754_0_main_Load(EOS(STATIC_754), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50))) → 758_0_main_Load(EOS(STATIC_758), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181)
758_0_main_Load(EOS(STATIC_758), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181) → 762_0_main_Load(EOS(STATIC_762), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(ARRAY(i50)))
762_0_main_Load(EOS(STATIC_762), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(ARRAY(i50))) → 766_0_main_ArrayAccess(EOS(STATIC_766), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(ARRAY(i50)), i181)
766_0_main_ArrayAccess(EOS(STATIC_766), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(ARRAY(i50)), i181) → 770_0_main_ArrayAccess(EOS(STATIC_770), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(ARRAY(i50)), i181)
770_0_main_ArrayAccess(EOS(STATIC_770), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(ARRAY(i50)), i181) → 777_0_main_InvokeMethod(EOS(STATIC_777), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, o65) | <(i181, i50)
777_0_main_InvokeMethod(EOS(STATIC_777), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(o68sub)) → 784_0_main_InvokeMethod(EOS(STATIC_784), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(o68sub))
784_0_main_InvokeMethod(EOS(STATIC_784), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(o68sub)) → 791_0_length_Load(EOS(STATIC_791), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(o68sub), java.lang.Object(o68sub))
791_0_length_Load(EOS(STATIC_791), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(o68sub), java.lang.Object(o68sub)) → 809_0_length_FieldAccess(EOS(STATIC_809), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(o68sub), java.lang.Object(o68sub))
809_0_length_FieldAccess(EOS(STATIC_809), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(java.lang.String(o72sub, i203)), java.lang.Object(java.lang.String(o72sub, i203))) → 816_0_length_FieldAccess(EOS(STATIC_816), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(java.lang.String(o72sub, i203)), java.lang.Object(java.lang.String(o72sub, i203))) | &&(>=(i203, 0), >=(i204, 0))
816_0_length_FieldAccess(EOS(STATIC_816), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(java.lang.String(o72sub, i203)), java.lang.Object(java.lang.String(o72sub, i203))) → 826_0_length_Return(EOS(STATIC_826), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(java.lang.String(o72sub, i203)))
826_0_length_Return(EOS(STATIC_826), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181, java.lang.Object(java.lang.String(o72sub, i203))) → 836_0_main_ArrayAccess(EOS(STATIC_836), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181)
836_0_main_ArrayAccess(EOS(STATIC_836), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181) → 844_0_main_ArrayAccess(EOS(STATIC_844), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181)
844_0_main_ArrayAccess(EOS(STATIC_844), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), java.lang.Object(ARRAY(i50)), i181) → 859_0_main_Inc(EOS(STATIC_859), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50))) | <(i181, i50)
859_0_main_Inc(EOS(STATIC_859), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50))) → 875_0_main_JMP(EOS(STATIC_875), java.lang.Object(ARRAY(i50)), +(i181, 1), i50, java.lang.Object(ARRAY(i50))) | >=(i181, 0)
875_0_main_JMP(EOS(STATIC_875), java.lang.Object(ARRAY(i50)), i218, i50, java.lang.Object(ARRAY(i50))) → 900_0_main_Load(EOS(STATIC_900), java.lang.Object(ARRAY(i50)), i218, i50, java.lang.Object(ARRAY(i50)))
900_0_main_Load(EOS(STATIC_900), java.lang.Object(ARRAY(i50)), i218, i50, java.lang.Object(ARRAY(i50))) → 731_0_main_Load(EOS(STATIC_731), java.lang.Object(ARRAY(i50)), i218, i50, java.lang.Object(ARRAY(i50)))
731_0_main_Load(EOS(STATIC_731), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50))) → 737_0_main_Load(EOS(STATIC_737), java.lang.Object(ARRAY(i50)), i181, i50, java.lang.Object(ARRAY(i50)), i181)
R rules:

Combined rules. Obtained 1 conditional rules for P and 0 conditional rules for R.

P rules:
737_0_main_Load(EOS(STATIC_737), java.lang.Object(ARRAY(x0)), x1, x0, java.lang.Object(ARRAY(x0)), x1) → 737_0_main_Load(EOS(STATIC_737), java.lang.Object(ARRAY(x0)), +(x1, 1), x0, java.lang.Object(ARRAY(x0)), +(x1, 1)) | &&(&&(&&(>(+(x1, 1), 0), <(x1, x0)), <(x1, -(x0, 1))), >(+(x0, 1), 0))
R rules:

Filtered ground terms:

737_0_main_Load(x1, x2, x3, x4, x5, x6) → 737_0_main_Load(x2, x3, x4, x5, x6)
EOS(x1) → EOS
Cond_737_0_main_Load(x1, x2, x3, x4, x5, x6, x7) → Cond_737_0_main_Load(x1, x3, x4, x5, x6, x7)

Filtered duplicate args:

737_0_main_Load(x1, x2, x3, x4, x5) → 737_0_main_Load(x4, x5)
Cond_737_0_main_Load(x1, x2, x3, x4, x5, x6) → Cond_737_0_main_Load(x1, x5, x6)

Combined rules. Obtained 1 conditional rules for P and 0 conditional rules for R.

P rules:
737_0_main_Load(java.lang.Object(ARRAY(x0)), x1) → 737_0_main_Load(java.lang.Object(ARRAY(x0)), +(x1, 1)) | &&(&&(&&(>(x1, -1), <(x1, x0)), <(x1, -(x0, 1))), >(x0, -1))
R rules:

Finished conversion. Obtained 2 rules for P and 0 rules for R. System has predefined symbols.

P rules:
737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0)), x1) → COND_737_0_MAIN_LOAD(&&(&&(&&(>(x1, -1), <(x1, x0)), <(x1, -(x0, 1))), >(x0, -1)), java.lang.Object(ARRAY(x0)), x1)
COND_737_0_MAIN_LOAD(TRUE, java.lang.Object(ARRAY(x0)), x1) → 737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0)), +(x1, 1))
R rules:

(29) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Boolean, Integer

R is empty.

The integer pair graph contains the following rules and edges:
(0): 737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[0])), x1[0]) → COND_737_0_MAIN_LOAD(x1[0] > -1 && x1[0] < x0[0] && x1[0] < x0[0] - 1 && x0[0] > -1, java.lang.Object(ARRAY(x0[0])), x1[0])
(1): COND_737_0_MAIN_LOAD(TRUE, java.lang.Object(ARRAY(x0[1])), x1[1]) → 737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[1])), x1[1] + 1)

(0) -> (1), if (x1[0] > -1 && x1[0] < x0[0] && x1[0] < x0[0] - 1 && x0[0] > -1 ∧java.lang.Object(ARRAY(x0[0])) →^* java.lang.Object(ARRAY(x0[1]))∧x1[0] →^* x1[1])

(1) -> (0), if (java.lang.Object(ARRAY(x0[1])) →^* java.lang.Object(ARRAY(x0[0]))∧x1[1] + 1 →^* x1[0])

The set Q is empty.

(30) IDPNonInfProof (SOUND transformation)

Used the following options for this NonInfProof:
IDPGPoloSolver: Range: [(-1,2)] IsNat: false Interpretation Shape Heuristic: aprove.DPFramework.IDPProblem.Processors.nonInf.poly.IdpCand1ShapeHeuristic@3f4a4567 Constraint Generator: NonInfConstraintGenerator: PathGenerator: MetricPathGenerator: Max Left Steps: 0 Max Right Steps: 0

The constraints were generated the following way:
The DP Problem is simplified using the Induction Calculus [NONINF] with the following steps:
Note that final constraints are written in bold face.

For Pair 737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0)), x1) → COND_737_0_MAIN_LOAD(&&(&&(&&(>(x1, -1), <(x1, x0)), <(x1, -(x0, 1))), >(x0, -1)), java.lang.Object(ARRAY(x0)), x1) the following chains were created:

We consider the chain 737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[0])), x1[0]) → COND_737_0_MAIN_LOAD(&&(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), <(x1[0], -(x0[0], 1))), >(x0[0], -1)), java.lang.Object(ARRAY(x0[0])), x1[0]), COND_737_0_MAIN_LOAD(TRUE, java.lang.Object(ARRAY(x0[1])), x1[1]) → 737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[1])), +(x1[1], 1)) which results in the following constraint:
(1)    (&&(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), <(x1[0], -(x0[0], 1))), >(x0[0], -1))=TRUE∧java.lang.Object(ARRAY(x0[0]))=java.lang.Object(ARRAY(x0[1]))∧x1[0]=x1[1] ⇒ 737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[0])), x1[0])≥NonInfC∧737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[0])), x1[0])≥COND_737_0_MAIN_LOAD(&&(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), <(x1[0], -(x0[0], 1))), >(x0[0], -1)), java.lang.Object(ARRAY(x0[0])), x1[0])∧(U^Increasing(COND_737_0_MAIN_LOAD(&&(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), <(x1[0], -(x0[0], 1))), >(x0[0], -1)), java.lang.Object(ARRAY(x0[0])), x1[0])), ≥))

We simplified constraint (1) using rules (I), (II), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(2)    (>(x0[0], -1)=TRUE∧<(x1[0], -(x0[0], 1))=TRUE∧>(x1[0], -1)=TRUE∧<(x1[0], x0[0])=TRUE ⇒ 737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[0])), x1[0])≥NonInfC∧737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[0])), x1[0])≥COND_737_0_MAIN_LOAD(&&(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), <(x1[0], -(x0[0], 1))), >(x0[0], -1)), java.lang.Object(ARRAY(x0[0])), x1[0])∧(U^Increasing(COND_737_0_MAIN_LOAD(&&(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), <(x1[0], -(x0[0], 1))), >(x0[0], -1)), java.lang.Object(ARRAY(x0[0])), x1[0])), ≥))

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(3)    (x0[0] ≥ 0∧x0[0] + [-2] + [-1]x1[0] ≥ 0∧x1[0] ≥ 0∧x0[0] + [-1] + [-1]x1[0] ≥ 0 ⇒ (U^Increasing(COND_737_0_MAIN_LOAD(&&(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), <(x1[0], -(x0[0], 1))), >(x0[0], -1)), java.lang.Object(ARRAY(x0[0])), x1[0])), ≥)∧[(-1)bni_10 + (-1)Bound*bni_10] + [(-1)bni_10]x1[0] + [(2)bni_10]x0[0] ≥ 0∧[(-1)bso_11] ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(4)    (x0[0] ≥ 0∧x0[0] + [-2] + [-1]x1[0] ≥ 0∧x1[0] ≥ 0∧x0[0] + [-1] + [-1]x1[0] ≥ 0 ⇒ (U^Increasing(COND_737_0_MAIN_LOAD(&&(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), <(x1[0], -(x0[0], 1))), >(x0[0], -1)), java.lang.Object(ARRAY(x0[0])), x1[0])), ≥)∧[(-1)bni_10 + (-1)Bound*bni_10] + [(-1)bni_10]x1[0] + [(2)bni_10]x0[0] ≥ 0∧[(-1)bso_11] ≥ 0)

We simplified constraint (4) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(5)    (x0[0] ≥ 0∧x0[0] + [-2] + [-1]x1[0] ≥ 0∧x1[0] ≥ 0∧x0[0] + [-1] + [-1]x1[0] ≥ 0 ⇒ (U^Increasing(COND_737_0_MAIN_LOAD(&&(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), <(x1[0], -(x0[0], 1))), >(x0[0], -1)), java.lang.Object(ARRAY(x0[0])), x1[0])), ≥)∧[(-1)bni_10 + (-1)Bound*bni_10] + [(-1)bni_10]x1[0] + [(2)bni_10]x0[0] ≥ 0∧[(-1)bso_11] ≥ 0)

We simplified constraint (5) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(6)    ([2] + x1[0] + x0[0] ≥ 0∧x0[0] ≥ 0∧x1[0] ≥ 0∧[1] + x0[0] ≥ 0 ⇒ (U^Increasing(COND_737_0_MAIN_LOAD(&&(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), <(x1[0], -(x0[0], 1))), >(x0[0], -1)), java.lang.Object(ARRAY(x0[0])), x1[0])), ≥)∧[(3)bni_10 + (-1)Bound*bni_10] + [bni_10]x1[0] + [(2)bni_10]x0[0] ≥ 0∧[(-1)bso_11] ≥ 0)

For Pair COND_737_0_MAIN_LOAD(TRUE, java.lang.Object(ARRAY(x0)), x1) → 737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0)), +(x1, 1)) the following chains were created:

We consider the chain COND_737_0_MAIN_LOAD(TRUE, java.lang.Object(ARRAY(x0[1])), x1[1]) → 737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[1])), +(x1[1], 1)) which results in the following constraint:
(7)    (COND_737_0_MAIN_LOAD(TRUE, java.lang.Object(ARRAY(x0[1])), x1[1])≥NonInfC∧COND_737_0_MAIN_LOAD(TRUE, java.lang.Object(ARRAY(x0[1])), x1[1])≥737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[1])), +(x1[1], 1))∧(U^Increasing(737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[1])), +(x1[1], 1))), ≥))

We simplified constraint (7) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(8)    ((U^Increasing(737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[1])), +(x1[1], 1))), ≥)∧[bni_12] = 0∧[1 + (-1)bso_13] ≥ 0)

We simplified constraint (8) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(9)    ((U^Increasing(737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[1])), +(x1[1], 1))), ≥)∧[bni_12] = 0∧[1 + (-1)bso_13] ≥ 0)

We simplified constraint (9) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(10)    ((U^Increasing(737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[1])), +(x1[1], 1))), ≥)∧[bni_12] = 0∧[1 + (-1)bso_13] ≥ 0)

We simplified constraint (10) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(11)    ((U^Increasing(737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[1])), +(x1[1], 1))), ≥)∧[bni_12] = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_13] ≥ 0)

To summarize, we get the following constraints P_≥ for the following pairs.

737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0)), x1) → COND_737_0_MAIN_LOAD(&&(&&(&&(>(x1, -1), <(x1, x0)), <(x1, -(x0, 1))), >(x0, -1)), java.lang.Object(ARRAY(x0)), x1)
- ([2] + x1[0] + x0[0] ≥ 0∧x0[0] ≥ 0∧x1[0] ≥ 0∧[1] + x0[0] ≥ 0 ⇒ (U^Increasing(COND_737_0_MAIN_LOAD(&&(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), <(x1[0], -(x0[0], 1))), >(x0[0], -1)), java.lang.Object(ARRAY(x0[0])), x1[0])), ≥)∧[(3)bni_10 + (-1)Bound*bni_10] + [bni_10]x1[0] + [(2)bni_10]x0[0] ≥ 0∧[(-1)bso_11] ≥ 0)
COND_737_0_MAIN_LOAD(TRUE, java.lang.Object(ARRAY(x0)), x1) → 737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0)), +(x1, 1))
- ((U^Increasing(737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[1])), +(x1[1], 1))), ≥)∧[bni_12] = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_13] ≥ 0)

POL(TRUE) = 0
POL(FALSE) = 0
POL(737_0_MAIN_LOAD(x₁, x₂)) = [-1] + [-1]x₂ + [2]x₁
POL(java.lang.Object(x₁)) = x₁
POL(ARRAY(x₁)) = x₁
POL(COND_737_0_MAIN_LOAD(x₁, x₂, x₃)) = [-1] + [-1]x₃ + [2]x₂
POL(&&(x₁, x₂)) = [-1]
POL(>(x₁, x₂)) = [-1]
POL(-1) = [-1]
POL(<(x₁, x₂)) = [-1]
POL(-(x₁, x₂)) = x₁ + [-1]x₂
POL(1) = [1]
POL(+(x₁, x₂)) = x₁ + x₂

The following pairs are in P_>:

COND_737_0_MAIN_LOAD(TRUE, java.lang.Object(ARRAY(x0[1])), x1[1]) → 737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[1])), +(x1[1], 1))

The following pairs are in P_bound:

737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[0])), x1[0]) → COND_737_0_MAIN_LOAD(&&(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), <(x1[0], -(x0[0], 1))), >(x0[0], -1)), java.lang.Object(ARRAY(x0[0])), x1[0])

The following pairs are in P_≥:

737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[0])), x1[0]) → COND_737_0_MAIN_LOAD(&&(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), <(x1[0], -(x0[0], 1))), >(x0[0], -1)), java.lang.Object(ARRAY(x0[0])), x1[0])

There are no usable rules.

(31) Complex Obligation (AND)

(32) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Boolean, Integer

(33) IDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.

(34) TRUE

(35) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Integer

R is empty.

The integer pair graph contains the following rules and edges:
(1): COND_737_0_MAIN_LOAD(TRUE, java.lang.Object(ARRAY(x0[1])), x1[1]) → 737_0_MAIN_LOAD(java.lang.Object(ARRAY(x0[1])), x1[1] + 1)

The set Q is empty.

(36) IDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.

(0) Obligation:

(1) JBCToGraph (SOUND transformation)

(2) Obligation:

(3) TerminationGraphToSCCProof (SOUND transformation)

(4) Complex Obligation (AND)

(5) Obligation:

(6) SCCToIDPv1Proof (SOUND transformation)

(7) Obligation:

(8) IDPNonInfProof (SOUND transformation)

(9) Complex Obligation (AND)

(10) Obligation:

(11) IDependencyGraphProof (EQUIVALENT transformation)

(12) TRUE

(13) Obligation:

(14) IDependencyGraphProof (EQUIVALENT transformation)

(15) TRUE

(16) Obligation:

(17) SCCToIDPv1Proof (SOUND transformation)

(18) Obligation:

(19) IDPNonInfProof (SOUND transformation)

(20) Obligation:

(21) IDependencyGraphProof (EQUIVALENT transformation)

(22) Obligation:

(23) IDPNonInfProof (SOUND transformation)

(24) Obligation:

(25) IDependencyGraphProof (EQUIVALENT transformation)

(26) TRUE

(27) Obligation:

(28) SCCToIDPv1Proof (SOUND transformation)

(29) Obligation:

(30) IDPNonInfProof (SOUND transformation)

(31) Complex Obligation (AND)

(32) Obligation:

(33) IDependencyGraphProof (EQUIVALENT transformation)

(34) TRUE

(35) Obligation:

(36) IDependencyGraphProof (EQUIVALENT transformation)

(37) TRUE